Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles
نویسندگان
چکیده
Avoiding Monochromatic Cycles Fabrice Talla Nobibon HEC-Management School, University of Liège, Rue Louvrex 14, Building N1, B-4000 Liège, Belgium, [email protected] Cor A.J. Hurkens Eindhoven University of Technology, Department of Mathematics and Computer Science. P.O. Box 513, 5600 MB Eindhoven, the Netherlands, [email protected] Roel Leus, Frits C.R. Spieksma University of Leuven, Operations Research Group, Naamsestraat 69, B-3000 Leuven, Belgium, {[email protected], [email protected]}
منابع مشابه
Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles
We consider the problem of deciding whether a given directed graph can be vertex partitioned into two acyclic subgraphs. Applications of this problem include testing rationality of collective consumption behavior, a subject in micro-economics. We prove that the problem is NP-complete even for oriented graphs and argue that the existence of a constant-factor approximation algorithm is unlikely f...
متن کاملOn Colorings Avoiding a Rainbow Cycle and a Fixed Monochromatic Subgraph
Let H and G be two graphs on fixed number of vertices. An edge coloring of a complete graph is called (H,G)-good if there is no monochromatic copy of G and no rainbow (totally multicolored) copy of H in this coloring. As shown by Jamison and West, an (H,G)-good coloring of an arbitrarily large complete graph exists unless either G is a star or H is a forest. The largest number of colors in an (...
متن کاملPartitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles
Consider a graph G on n vertices satisfying the following Ore-type condition: for any two non-adjacent vertices x and y of G, we have deg(x)+deg(y) > 3n/2. We conjecture that if we color the edges of G with 2 colors then the vertex set of G can be partitioned to two vertex disjoint monochromatic cycles of distinct colors. In this paper we prove an asymptotic version of this conjecture. 1 Backgr...
متن کاملMonochromatic Path and Cycle Partitions in Hypergraphs
Here we address the problem to partition edge colored hypergraphs by monochromatic paths and cycles generalizing a well-known similar problem for graphs. We show that r-colored r-uniform complete hypergraphs can be partitioned into monochromatic Berge-paths of distinct colors. Also, apart from 2k − 5 vertices, 2-colored k-uniform hypergraphs can be partitioned into two monochromatic loose paths...
متن کاملEdge-colorings avoiding rainbow and monochromatic subgraphs
For two graphs G and H , let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph with n vertices having no monochromatic subgraph isomorphic to G and no totally multicolored (rainbow) subgraph isomorphic to H . These two numbers generalize the classical anti-Ramsey and Ramsey numbers, respectively. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- INFORMS Journal on Computing
دوره 24 شماره
صفحات -
تاریخ انتشار 2012